Under Consideration for Publication in Theory and Practice of Logic Programming Book Review
نویسنده
چکیده
Models and Games by Jouko Väänänen is a book that examines logic from a gametheoretic perspective. Games are nowadays considered to be a standard tool in mathematical logic. They are easy to describe and use and for this reason they have gained wide acceptance in logic during the second half of the twentieth century. Proofs involving games are easier to state and understand and may lead to novel insights and to other unexpected results. Models and Games gives a broad and detailed coverage of the use of games in mathematical logic. The logics that are studied in the book under the gametheoretic viewpoint are first-order logic (Chapters 1 to 6), infinitary logics (Chapters 7 to 9) and finally logics with generalized quantifiers (Chapter 10). There are three main games that are used throughout the book in order to study the above logics:
منابع مشابه
Under Consideration for Publication in Theory and Practice of Logic Programming Book Review * Introduction to Constraint Databases
This book is the first textbook on constraint databases. Its author, together with P. Kanellakis and G. Kuper, introduced constraint databases in 1990 as a powerful generalization of the relational database model. Constraints, such as linear or polynomial equalities and inequalities, are used to finitely represent possibly infinite sets of points. They provide an elegant way to combine classica...
متن کاملUnder Consideration for Publication in Theory and Practice of Logic Programming Book Review
Constraint programming is a very active research area that lies at the intersection of AI, OR, Programming Languages, Data Bases, and Graph Theory, and whose main aim is to model naturally and solve efficiently real-life problems that can be cast as a set of objects and a set of restrictions (that is, constraints) on how these objects can co-exist in the same problem. Constraint programming sta...
متن کاملStable models for infinitary formulas with extensional atoms
The definition of stable models for propositional formulas with infinite conjunctions and disjunctions can be used to describe the semantics of answer set programming languages. In this note, we enhance that definition by introducing a distinction between intensional and extensional atoms. The symmetric splitting theorem for first-order formulas is then extended to infinitary formulas and used ...
متن کاملUnder consideration for publication in Theory and Practice of Logic Programming 1 Logic program specialisation through
Program specialisation aims at improving the overall performance of programs by performing source to source transformations. A common approach within functional and logic programming, known respectively as partial evaluation and partial deduction, is to exploit partial knowledge about the input. It is achieved through a well-automated application of parts of the Burstall-Darlington unfold/fold ...
متن کامل